On Various Combinatorial Sums and Related Identities

نویسندگان

  • Zhi-Wei Sun
  • ZHI-WEI SUN
چکیده

In this talk we give a survey of results and methods on some combinatorial sums involving binomial coefficients and related to Bernoulli and Euler polynomials. We will also talk about certain sums of minima and maxima related to Dedekind sums. Some interesting identities associated with the various sums will also be introduced. 1. A curious identity and the sum ∑ k≡r (mod m) ( n k ) In 1988 Zhi-Wei Sun proved a conjecture of his twin brother Zhi-Hong Sun, later he made a further extension by establishing the following result. Theorem 1.1 [Z. W. Sun, Integers 2(2002)]. Let m ∈ N = {0, 1, 2, . . . }. Then we have the curious identity

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bernstein Basis Functions Related to Combinatorial Sums Involving Binomial Coefficients and Special Numbers

By using generating functions, which contained alternative forms, we derive identities, some new and old, for the Bernstein basis functions. Integrating these identities, we also derive combinatorial sums involving binomial coefficients. We give relations between these combinatorial sums and generating functions for special numbers, we investigate relations related to finite sums of the powers ...

متن کامل

A Pascal-like Triangle Related to the Tribonacci Numbers

A tile composed of two pieces, which we refer to as a fence tile, is introduced to give the Tribonacci numbers a new combinatorial interpretation. The interpretation is used to construct a Pascal-like triangle and various identities concerning the triangle are proven. An intuitive proof of a general identity for the Tribonacci numbers in terms of sums of products of the binomial coefficients is...

متن کامل

Some New Binomial Sums Related to the Catalan Triangle

In this paper, we derive many new identities on the classical Catalan triangle C = (Cn,k)n>k>0, where Cn,k = k+1 n+1 ( 2n−k n ) are the well-known ballot numbers. The first three types are based on the determinant and the fourth is relied on the permanent of a square matrix. It not only produces many known and new identities involving Catalan numbers, but also provides a new viewpoint on combin...

متن کامل

Catalan Triangle Numbers and Binomial Coefficients

The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac–Moody algebras. We prove that any binomial coefficient can be written as weighted sums along rows of the Catalan triangle. The coefficients in the sums form a triangular array, which we call the alternating Jacobsthal triangle. We study various subs...

متن کامل

Rational Functions Certify Combinatorial Identities

This paper presents a general method for proving and discovering combinatorial identities: to prove an identity one can present a certi cate that consists of a pair of functions of two integer variables. To prove the identity, take the two functions that are given, check that condition (1) below is satis ed (a simple mechanical task), and check the equally simple fact that the boundary conditio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004